An Implicitly Restarted Block Lanczos Bidiagonalization Method Using Leja Shifts
نویسندگان
چکیده
In this paper, we propose an implicitly restarted block Lanczos bidiagonalization (IRBLB) method for computing a few extreme or interior singular values and associated right and left singular vectors of a large matrix A. Our method combines the advantages of a block routine, implicit shifting, and the application of Leja points as shifts in the accelerating polynomial. The method neither requires factorization of A nor of a matrix that contains A. This makes the method well suited for very large matrices. For many matrices, the method presented in this paper requires less computational work and computer storage than other available approaches. Computed examples illustrate the performance of the method described.
منابع مشابه
A Refined Harmonic Lanczos Bidiagonalization Method and an Implicitly Restarted Algorithm for Computing the Smallest Singular Triplets of Large Matrices
The harmonic Lanczos bidiagonalization method can be used to compute the smallest singular triplets of a large matrix A. We prove that for good enough projection subspaces harmonic Ritz values converge if the columns of A are strongly linearly independent. On the other hand, harmonic Ritz values may miss some desired singular values when the columns of A are almost linearly dependent. Furthermo...
متن کاملA harmonic Lanczos bidiagonalization method for computing interior singular triplets of large matrices
This paper proposes a harmonic Lanczos bidiagonalization method for computing some interior singular triplets of large matrices. It is shown that the approximate singular triplets are convergent if a certain Rayleigh quotient matrix is uniformly bounded and the approximate singular values are well separated. Combining with the implicit restarting technique, we develop an implicitly restarted ha...
متن کاملAugmented Implicitly Restarted Lanczos Bidiagonalization Methods
New restarted Lanczos bidiagonalization methods for the computation of a few of the largest or smallest singular values of a large matrix are presented. Restarting is carried out by augmentation of Krylov subspaces that arise naturally in the standard Lanczos bidiagonalization method. The augmenting vectors are associated with certain Ritz or harmonic Ritz vectors. Computed examples show the ne...
متن کاملAn Implicitly Restarted Lanczos Method for Large Symmetric Eigenvalue Problems
The Lanczos process is a well known technique for computing a few, say k, eigenvalues and associated eigenvectors of a large symmetric n×n matrix. However, loss of orthogonality of the computed Krylov subspace basis can reduce the accuracy of the computed approximate eigenvalues. In the implicitly restarted Lanczos method studied in the present paper, this problem is addressed by fixing the num...
متن کاملAn Implicitly Restarted Lanczos Bidiagonalization Method for Computing Smallest Singular Triplets
We describe the development of a method for the efficient computation of the smallest singular values and corresponding vectors for large sparse matrices [4]. The method combines state-of-the-art techniques that make it a useful computational tool appropriate for large scale computations. The method relies upon Lanczos bidiagonalization (LBD) with partial reorthogonalization [6], enhanced with ...
متن کامل